A numerical algorithm for constrained optimal control problems

نویسندگان

چکیده

In this paper, we consider a general class of discrete-time optimal control problems subject to all-time-step constraints on the state and variables. The derivations gradient formulas for cost constraint functions constrained problem are rather involved. We present simple approach these based reversed automatic differentiation. On basis, numerical algorithm is developed solve problem. then continuous-time continuous inequality constraints. This discretized into with using Euler discretization method. Then, applied Numerical examples presented verify applicability proposed methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Optimal Solution Concept for Fuzzy Optimal Control Problems

In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...

متن کامل

A Numerical Approach for Fractional Optimal Control Problems by Using Ritz Approximation

In this article, Ritz approximation have been employed to obtain the numerical solutions of a class of the fractional optimal control problems based on the Caputo fractional derivative. Using polynomial basis functions, we obtain a system of nonlinear algebraic equations. This nonlinear system of equation is solved and the coefficients of basis polynomial are derived. The convergence of the num...

متن کامل

Pareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm

Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...

متن کامل

A virtual control concept for state constrained optimal control problems

where Ω ⊂ RN , N = 2, 3 is a bounded domain with C0,1-boundary, ν > 0 is a fixed number, yd and yc are given functions from L2(Ω). Furthermore, ua and ub are given real numbers with ua < ub. The difficulty of low regularity of solutions of problems with pointwise state constraints is pointed out in (1). Therefore, different regularization concepts are developed, see e.g. (2), (3), (4) and (5). ...

متن کامل

A Method for Solving Optimal Control Problems Using Genetic Programming

This paper deals with a novel method for solving optimal control problems based on genetic programming. This approach produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Using numerical examples, we will demonstrate how to use the results.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Industrial and Management Optimization

سال: 2023

ISSN: ['1547-5816', '1553-166X']

DOI: https://doi.org/10.3934/jimo.2023053